Negation and Implication in Quasi-Nelson Logic

نویسندگان

چکیده

Quasi-Nelson logic is a recently-introduced generalization of Nelson’s constructive with strong negation to non-involutive setting. In the present paper we axiomatize negation-implication fragment quasi-Nelson (QNI-logic), which constitutes in sense algebraizable core logic. We introduce finite Hilbert-style calculus for QNI-logic, showing completeness and algebraizability respect variety QNI-algebras. Members latter class, also introduced investigated recent paper, are precisely subreducts algebras. Relying on our result, show how fragments intuitionistic may both be obtained as schematic extensions QNI-logic.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Admissible rules in the implication-negation fragment of intuitionistic logic

Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication–negation fragments of intuitionistic logic IPC and its consistent axiomatic extensions (intermediate logics). A Kripke semantics characterization is given for the (hereditarily) structurally complete implication–negation fragments of intermediate logics, and it is shown that ...

متن کامل

Negation Without Negation in Probabilistic Logic Programming

Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...

متن کامل

On the Asymptotic Density of Tautologies in Logic of Implication and Negation

The paper solves the problem of finding the asymptotic probability of the set of tautologies of classical logic with one propositional variable, implication and negation. We investigate the proportion of tautologies of the given length n among the number of all formulas of length n. We are especially interested in asymptotic behavior of this proportion when n→∞. If the limit exists it represent...

متن کامل

Negation in Contextual Logic

This contribution discusses a formalization of the “negation of a concept”. The notion of “concept” has been successfully formalized in the early eighties and led to the theory of Formal Concept Analysis. Boole (1815-1864) developed a mathematical theory for human thought based on signs and classes. The formalization of the negation of concepts is needed in order to develop a mathematical theor...

متن کامل

Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logi?eskie issledovaniâ

سال: 2021

ISSN: ['2413-2713', '2074-1472']

DOI: https://doi.org/10.21146/2074-1472-2021-27-1-107-123